Order Independent and Persistent Typed Default Uniication
نویسندگان
چکیده
We deene an order independent version of default uniication on typed feature structures. The operation is one where default information in a feature structure typed with a more speciic type, will override default information in a feature structure typed with a more general type, where speciicity is deened by the subtyping relation in the type hierarchy. The operation is also able to handle feature structures where reentrancies are default. We provide a formal semantics, prove order independence and demonstrate the utility of this version of default uniication in several linguistic applications. First, we show how it can be used to deene multiple orthogonal default inheritance in the lexicon in a fully declarative fashion. Secondly, we show how default lexical speciications (introduced via default lexical inheritance) can be made to usefully`persist beyond the lexicon' and interact with syntagmatic rules. Finally, we outline how persistent default uniication might underpin default feature propagation principles and a more restrictive and constraint-based approach to lexical rules.
منابع مشابه
Unification in an Extensional Lambda Calculus with Ordered Function Sorts and Constant Overloading
The introduction of sorts in rst-order automatic theorem proving has been accompanied by a considerable gain in computational eeciency via reduced search spaces. This suggests that sort information can be employed in higher-order theorem proving with similar results. This paper develops an order-sorted higher-order calculus suitable for automatic theorem proving applications | by extending the ...
متن کاملHigher-Order Rigid E-Unification
Higher-order E-uniication, i.e. the problem of nding substitutions that make two simply typed-terms equal modulo or-equivalence and a given equational theory, is undecidable. We propose to rigidify it, to get a resource-bounded decidable uniication problem (with arbitrary high bounds), providing a complete higher-order E-uniication procedure. The techniques are inspired from Gallier's rigid E-u...
متن کاملA Colored Version of the -
Rippling is a technique developed for inductive theorem proving which uses syntactic diierences of terms to guide the proof search. Annotations (like colors) to terms are used to maintain this information. This technique has several advantages, e.g. it is highly goal oriented and involves little search. In this paper we give a general formalisation of coloring terms in a higher-order setting. W...
متن کاملHigher-Order Uni cation via Combinators
We present an algorithm for uniication in the simply typed lambda calculus which enumerates complete sets of uniiers using a nitely branching search space. In fact, the types of terms may contain type-variables, so that a solution may involve type-substitution as well as term-substitution. the problem is rst translated into the problem of uniication with respect to extensional equality in combi...
متن کاملLinear Second-order Uniication ?
We present a new class of second-order uniication problems, which we have called linear. We deal with completely general second-order typed uniication problems, but we restrict the set of uniiers under consideration: they instantiate free variables by linear terms, i.e. terms where any-abstractions bind one and only one occurrence of a bound variable. Linear second-order uniication properly ext...
متن کامل